Solving Alignment Using Elementary Linear Algebra

نویسندگان

  • David Bau
  • Induprakas Kodukula
  • Vladimir Kotlyar
  • Keshav Pingali
  • Paul Stodghill
چکیده

Data and computation alignment is an important part of compiling sequential programs to architectures with non uniform memory access times In this paper we show that elementary matrix methods can be used to determine communication free alignment of code and data We also solve the problem of replicating data to eliminate communication Our matrix based approach leads to algorithms which work well for a variety of applications and which are simpler and faster than other matrix based algorithms in the literature

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Test Matrix Generation

We discuss the design and implementation of a suite of test matrix generators for testing linear algebra software. These routines generate random matrices with certain properties which are useful for testing linear equation solving, least squares, and eigendecomposition software. These properties include the spectrum, symmetry, bandwidth, norm, sparsity, conditioning (with respect to inversion ...

متن کامل

LAPACK Working Note 9 A Test Matrix Generation

We discuss the design and implementation of a suite of test matrix generators for testing linear algebra software. These routines generate random matrices with certain properties which are useful for testing linear equation solving, least squares, and eigendecomposition software. These properties include the spectrum, symmetry, bandwidth, norm, sparsity, conditioning (with respect to inversion ...

متن کامل

Lapack Working Note 9 a T Est Matrix Generation Suite

We discuss the design and implementation of a suite of test matrix generators for testing linear algebra software. These routines generate random matrices with certain properties which are useful for testing linear equation solving, least squares, and eigendecomposition software. These properties include the spectrum, symmetry, bandwidth, norm, sparsity, conditioning (with respect to inversion ...

متن کامل

Solving the liner quadratic differential equations with constant coefficients using Taylor series with step size h

In this study we produced a new method for solving regular differential equations with step size h and Taylor series. This method analyzes a regular differential equation with initial values and step size h. this types of equations include quadratic and cubic homogenous equations with constant coeffcients and cubic and second-level equations.

متن کامل

Operational matrices with respect to Hermite polynomials and their applications in solving linear differential equations with variable coefficients

In this paper, a new and efficient approach is applied for numerical approximation of the linear differential equations with variable coeffcients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansion coeffcients for the moments of derivatives of any differentiable function in terms of the original expansion coefficients of the f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994